Independent AND-Parallel Implementation of Narrowing
نویسندگان
چکیده
Abs t r ac t . We present a parallel graph narrowing machine, which is used to implement a functional logic language on a shared memory multiprocessor. It is an extensión of an abstract machine for a purely functional language. The result is a programmed graph reduction machine which integrates the mechanisms of unification, backtracking, and independent and-parallelism. In the machine, the subexpressions of an expression can run in parallel. In the case of backtracking, the structure of an expression is used to avoid the reevaluation of subexpressions as far as possible. Deterministic computations are detected. Their results are maintained and need not be reevaluated after backtracking.
منابع مشابه
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملMulti-paradigm Logic Programming Sequential Implementation of Parallel Narrowing
Parallel Narrowing is a narrowing strategy which exploits expression parallelism. We present the rst implementation by transforming weakly orthogonal, constructor-based programs into Prolog with the help of parallel deenitional trees. We deene translation scheme for the general case of multistep narrowing, which is then extended to parallel narrowing by additional elimination rules. Our impleme...
متن کاملSequential Implementation of Parallel Narrowing
Parallel narrowing has been proposed by Antoy, Echahed and Hanus. They generalize to narrowing the notion of necessary set of redexes introduced by Sekar and Ramakrishnan. We present a high-level implementation by transforming weakly orthogonal, constructor-based programs into Prolog with the help of parallel deenitional trees. For strategies based on parallel rewriting, this is particularly di...
متن کاملForward kinematic analysis of planar parallel robots using a neural network-based approach optimized by machine learning
The forward kinematic problem of parallel robots is always considered as a challenge in the field of parallel robots due to the obtained nonlinear system of equations. In this paper, the forward kinematic problem of planar parallel robots in their workspace is investigated using a neural network based approach. In order to increase the accuracy of this method, the workspace of the parallel robo...
متن کاملImplementation of the direction of arrival estimation algorithms by means of GPU-parallel processing in the Kuda environment (Research Article)
Direction-of-arrival (DOA) estimation of audio signals is critical in different areas, including electronic war, sonar, etc. The beamforming methods like Minimum Variance Distortionless Response (MVDR), Delay-and-Sum (DAS), and subspace-based Multiple Signal Classification (MUSIC) are the most known DOA estimation techniques. The mentioned methods have high computational complexity. Hence using...
متن کامل